On optimum parameter modulation-estimation from a large deviations perspective
نویسنده
چکیده
We consider the problem of jointly optimum modulation and estimation of a real– valued random parameter, conveyed over an additive white Gaussian noise (AWGN) channel, where the performance metric is the large deviations behavior of the estimator, namely, the exponential decay rate (as a function of the observation time) of the probability that the estimation error would exceed a certain threshold. Our basic result is in providing an exact characterization of the fastest achievable exponential decay rate, among all possible modulator–estimator (transmitter–receiver) pairs, where the modulator is limited only in the signal power, but not in bandwidth. This exponential rate turns out to be given by the reliability function of the AWGN channel. We also discuss several ways to achieve this optimum performance, and one of them is based on quantization of the parameter, followed by optimum channel coding and modulation, which gives rise to a separation–based transmitter, if one views this setting from the perspective of joint source–channel coding. This is in spite of the fact that, in general, when error exponents are considered, the source–channel separation theorem does not hold true. We also discuss several observations, modifications and extensions of this result in several directions, including other channels, and the case of multidimensional parameter vectors. One of our findings concerning the latter, is that there is an abrupt threshold effect in the dimensionality of the parameter vector: below a certain critical dimension, the probability of excess estimation error may still decay exponentially, but beyond this value, it must converge to unity.
منابع مشابه
Moderate Deviations for System Identification: Error Bounds from a Probability Concentration Perspective
This paper is devoted to moderate deviations for characterizing parameter estimation errors in system identification. Moderate deviations for system identification provide probabilistic error bounds that are beyond laws of large numbers and central limit theorems, and cannot be expressed in terms of large deviations bounds. Such error bounds are crucial in complexity analysis for system identif...
متن کاملOn Bahadur Efficiency and Maximum Likelihood Estimation in General Parameter Spaces
The paper studies large deviations of maximum likelihood and related estimates in the case of i.i.d. observations with distribution determined by a parameter θ taking values in a general metric space. The main theorems provide sufficient conditions under which an approximate sieve maximum likelihood estimate is an asymptotically locally optimal estimate of g(θ) in the sense of Bahadur, for virt...
متن کاملIRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Exponential Error Bounds on Parameter Modulation- Estimation for Discrete Memoryless Channels
We consider the problem of modulation and estimation of a random parameter U to be conveyed across a discrete memoryless channel. Upper and lower bounds are derived for the best achievable exponential decay rate of a general moment of the estimation error, E|Û−U |ρ, ρ ≥ 0, when both the modulator and the estimator are subjected to optimization. These exponential error bounds turn out to be inti...
متن کاملExponential error bounds on parameter modulation-estimation for discrete memoryless channels
We consider the problem of modulation and estimation of a random parameter U to be conveyed across a discrete memoryless channel. Upper and lower bounds are derived for the best achievable exponential decay rate of a general moment of the estimation error, E|Û−U |ρ, ρ ≥ 0, when both the modulator and the estimator are subjected to optimization. These exponential error bounds turn out to be inti...
متن کاملLarge-scale Inversion of Magnetic Data Using Golub-Kahan Bidiagonalization with Truncated Generalized Cross Validation for Regularization Parameter Estimation
In this paper a fast method for large-scale sparse inversion of magnetic data is considered. The L1-norm stabilizer is used to generate models with sharp and distinct interfaces. To deal with the non-linearity introduced by the L1-norm, a model-space iteratively reweighted least squares algorithm is used. The original model matrix is factorized using the Golub-Kahan bidiagonalization that proje...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 58 شماره
صفحات -
تاریخ انتشار 2012